Packing and Decomposition Problems for Polynomial Association Schemes
نویسندگان
چکیده
منابع مشابه
Polynomial Time Approximation Schemes for Class-Constrained Packing Problems
We consider variants of the classic bin packing and multiple knapsack problems, in which sets of items of di erent classes (colours) need to be placed in bins; the items may have di<erent sizes and values. Each bin has a limited capacity, and a bound on the number of distinct classes of items it can accommodate. In the class-constrained multiple knapsack (CCMK) problem, our goal is to maximize ...
متن کاملImprimitive Q-polynomial Association Schemes
It is well known that imprimitive P -polynomial association schemes X = (X, {Ri}0≤i≤d) with k1 > 2 are either bipartite or antipodal, i.e., intersection numbers satisfy either ai = 0 for all i, or bi = cd−i for all i 6= [d/2]. In this paper, we show that imprimitiveQ-polynomial association schemesX = (X, {Ri}0≤i≤d) with d > 6 and k∗ 1 > 2 are either dual bipartite or dual antipodal, i.e., dual ...
متن کاملDeterministic Polynomial Factoring and Association Schemes
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field Fq has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the generalized Riemann hypothesis (GRH). In this work we improve the state of the art by focusing on prime degree polynomials; let n be the degree. If (n − 1) has a ‘larg...
متن کاملAssociation Schemes with Multiple Q-polynomial Structures
It is well known that an association scheme X = (X, {Ri}0≤i≤d) with k1 > 2 has at most two P polynomial structures. The parametrical condition for an association scheme to have twoP -polynomial structures is also known. In this paper, we give a similar result for Q-polynomial association schemes. In fact, if d > 5, then we obtain exactly the same parametrical conditions for the dual intersectio...
متن کاملNew families of Q-polynomial association schemes
In this paper, we construct the first known infinite family of primitive Qpolynomial schemes which are not generated by distance-regular graphs. To construct these examples, we introduce the notion of a relative hemisystem of a generalized quadrangle with respect to a subquadrangle.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1993
ISSN: 0195-6698
DOI: 10.1006/eujc.1993.1049